Quasi-Kernels for Oriented Paths and Cycles
نویسندگان
چکیده
If D is a digraph, then K V D is a quasi-kernel of D if D K is discrete and for each y V D K there is x K such that the directed distance from y to x is less than three. We give formulae for the number of quasi-kernels and for the number of minimal quasi-kernels of oriented paths and cycles.
منابع مشابه
Characterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملKernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes
In this paper, we give sufficient conditions for the existence of kernels by monochromatic directed paths (m.d.p.) in digraphs with quasi-transitive colorings. Let D be an m-colored digraph. We prove that if every chromatic class of D is quasi-transitive, every cycle is quasitransitive in the rim and D does not contain polychromatic triangles, then D has a kernel by m.d.p. The same result is va...
متن کاملSome Results on Chromaticity of Quasi-Linear Paths and Cycles
Let r > 1 be an integer. An h-hypergraph H is said to be r-quasi-linear (linear for r = 1) if any two edges of H intersect in 0 or r vertices. In this paper it is shown that r-quasi-linear paths P h,r m of length m > 1 and cycles C h,r m of length m > 3 are chromatically unique in the set of h-uniform r-quasi-linear hypergraphs provided r > 2 and h > 3r − 1.
متن کاملPaths, Trees and Cycles in Tournaments
We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments. Several unsolved problems are included.
متن کاملKernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a size bounded by a polynomial in a specified parameter (or, in short: do not have a polynomial kernel); these results are assuming the validity of certain complexity theoretic assumptions. We build upon recent results ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013